Towards SMT Model Checking of Array-Based Systems
نویسندگان
چکیده
We introduce the notion of array-based system as a suitable abstraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-first order formulae to symbolically represent array-based systems, we propose methods to check safety (invariance) and liveness (recurrence) properties on top of Satisfiability Modulo Theories solvers. We find hypotheses under which the verification procedures for such properties can be fully mechanized. c ©SpringerVerlag 2008
منابع مشابه
Model-Checking Modulo Theories at Work: the integration of Yices in MCMT
Recently, the notion of an array-based system has been introduced as an abstraction of infinite state systems (such as parametrised systems) which allows for model checking safety properties by SMT solving. Unfortunately, the use of quantified first-order formulae to describe sets of states makes checking for fix-point and unsafety extremely expensive. In this paper, we describe (static and dyn...
متن کاملLight-Weight SMT-based Model Checking
Recently, the notion of an array-based system has been introduced as an abstraction of infinite state sys-tems (such as mutual exclusion protocols or sorting programs) which allows for model checking of invariant(safety) and recurrence (liveness) properties by Satisfiability Modulo Theories (SMT) techniques. Unfortu-nately, the use of quantified first-order formulae to describe sets...
متن کاملCounter Abstractions in Model Checking of Distributed Broadcast Algorithms: Some Case Studies
The automated, formal verification of distributed algorithms is a crucial, although challenging, task. In this paper, we study the properties of distributed algorithms solving the reliable broadcast problem in various failure models. We investigate the suitability of a direct Satisfiability Modulo Theories (SMT) approach to model these algorithms in order to validate safety properties. In a pre...
متن کاملSolving conjunctive and disjunctive parameterized Boolean equation systems using SMT solvers
In this paper, we consider methods for solving model checking problems expressed as parameterized Boolean equation systems symbolically by making use of SMT solvers. By unrolling the PBES and expressing relevant properties of that unrolling as an SMT proposition, the solution to the model checking problem expressed by a PBES can be computed by an SMT solver. Based on this technique, we present ...
متن کاملSMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL
We define the SMT-based bounded model checking (BMC) method for Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. We implemented the new BMC algorithm and compared it with the SATbased BMC method for the same systems and the same property language on several benchmarks for multi-agent systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008